Discrete rectilinear 2-center problems

نویسندگان

  • Matthew J. Katz
  • Klara Kedem
  • Michael Segal
چکیده

Given a set P of n points in the plane, we seek two squares such that their center points belong to P , their union contains P , and the area of the larger square is minimal. We present efficient algorithms for three variants of this problem: In the first the squares are axis parallel, in the second they are free to rotate but must remain parallel to each other, and in the third they are free to rotate independently.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rectilinear 2-center problems

We present e cient algorithms for two problems of facility location. In both problems we want to optimize the location of two facilities with respect to n given sites. The rst problem, the continuous version, has no restrictions for facility locations but in the second one, the discrete version, facilities are chosen from a speci ed set of possible locations. We consider the rectilinear metric ...

متن کامل

On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model

Helly’s theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. In discrete Helly theorems the common point should belong to an a priori given set. In lexicographic Helly theorems the common point should not be lexicographically greater than a given point. Using discrete and lexicograph...

متن کامل

Discrete and Lexicographic Helly Theorems and their Relations to LP-Type Problems

Helly’s theorem says that if every d + 1 elements of a given finite set of convex objects in IR have a common point, then there is a point common to all of the objects in the set. We define three new types of Helly theorems: discrete Helly theorems where the common point should belong to an a-priori given set, lexicographic Helly theorems where the common point should not be lexicographically g...

متن کامل

Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics

Scheinerman and Wilf [SW94] assert that “an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph Kn.” A rectilinear drawing of Kn is an arrangement of n vertices in the plane, every pair of which is connected by an edge that is a line segment. We assume that no three vertices are collinear, and that no three edges intersec...

متن کامل

Mathematical Programming Formulation of Rectilinear Crossing Minimization

In a rectilinear drawing of a simple graph G each vertex is mapped to a distinct point in the plane and each edge is represented by a straight-line segment with appropriate ends. The goal of rectilinear crossing minimization is to find a rectilinear drawing of G with as few edge crossings as possible. A new approach to rectilinear crossing minimization is presented including a formulation of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Geom.

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2000